Left Termination proof of /tmp/tmpsmRjQw/maximum-fbf.pl

Left Termination of the query pattern
max(a,g,a)
w.r.t. the given Prolog program could successfully be proven:

0 Prolog

↳1 PrologToPrologProblemTransformerProof (⇒, 81 ms)

↳2 Prolog

↳3 PrologToPiTRSProof (⇒, 21 ms)

↳4 PiTRS

↳5 DependencyPairsProof (⇔, 0 ms)

↳6 PiDP

↳7 DependencyGraphProof (⇔, 0 ms)

↳8 AND

    ↳9 PiDP

        ↳10 UsableRulesProof (⇔, 0 ms)

        ↳11 PiDP

        ↳12 PiDPToQDPProof (⇒, 0 ms)

        ↳13 QDP

        ↳14 QDPSizeChangeProof (⇔, 2 ms)

        ↳15 YES

    ↳16 PiDP

        ↳17 UsableRulesProof (⇔, 0 ms)

        ↳18 PiDP

        ↳19 PiDPToQDPProof (⇒, 0 ms)

        ↳20 QDP

        ↳21 QDPSizeChangeProof (⇔, 0 ms)

        ↳22 YES

(0) Obligation:

Clauses:

max(X, Y, X) :- less(Y, X).
max(X, Y, Y) :- less(X, s(Y)).
less(0, s(X1)).
less(s(X), s(Y)) :- less(X, Y).

Query: max(a,g,a)

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph ICLP10.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: max(T1, T2, T3)\n\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: max(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | max(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: less(T7, T8) | max(T1, T7, T3), SCOPE: 1, CLAUSE: 1\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: max(T1, T2, T3), SCOPE: 1, CLAUSE: 1\n\nT2 is ground\nX4 is free\nX5 is free\nmax(T1, T2, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: less(T7, T8), SCOPE: 2, CLAUSE: 2 | less(T7, T8), SCOPE: 2, CLAUSE: 3 | ?_2 | max(T1, T7, T3), SCOPE: 1, CLAUSE: 1\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: less(T7, T8), SCOPE: 2, CLAUSE: 2\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: less(T7, T8), SCOPE: 2, CLAUSE: 3 | ?_2 | max(T1, T7, T3), SCOPE: 1, CLAUSE: 1\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: less(T7, T8), SCOPE: 2, CLAUSE: 3\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: ?_2 | max(T1, T7, T3), SCOPE: 1, CLAUSE: 1\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: less(T22, T24)\n\nT22 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: less(T22, T24), SCOPE: 3, CLAUSE: 2 | less(T22, T24), SCOPE: 3, CLAUSE: 3\n\nT22 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: less(T22, T24), SCOPE: 3, CLAUSE: 2\n\nT22 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: less(T22, T24), SCOPE: 3, CLAUSE: 3\n\nT22 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: less(T36, T38)\n\nT36 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: max(T1, T7, T3), SCOPE: 1, CLAUSE: 1\n\nT7 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: less(T47, s(T46))\n\nT46 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: less(T47, s(T46)), SCOPE: 4, CLAUSE: 2 | less(T47, s(T46)), SCOPE: 4, CLAUSE: 3\n\nT46 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: less(T47, s(T46)), SCOPE: 4, CLAUSE: 2\n\nT46 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: less(T47, s(T46)), SCOPE: 4, CLAUSE: 3\n\nT46 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: less(T61, T60)\n\nT60 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: less(T61, T60), SCOPE: 5, CLAUSE: 2 | less(T61, T60), SCOPE: 5, CLAUSE: 3\n\nT60 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: less(T61, T60), SCOPE: 5, CLAUSE: 2\n\nT60 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: less(T61, T60), SCOPE: 5, CLAUSE: 3\n\nT60 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: less(T75, T74)\n\nT74 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: less(T82, s(T81))\n\nT81 is ground\nX4 is free\nX5 is free\nmax(T1, T81, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: less(T82, s(T81)), SCOPE: 6, CLAUSE: 2 | less(T82, s(T81)), SCOPE: 6, CLAUSE: 3\n\nT81 is ground\nX4 is free\nX5 is free\nmax(T1, T81, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: less(T82, s(T81)), SCOPE: 6, CLAUSE: 2\n\nT81 is ground\nX4 is free\nX5 is free\nmax(T1, T81, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: less(T82, s(T81)), SCOPE: 6, CLAUSE: 3\n\nT81 is ground\nX4 is free\nX5 is free\nmax(T1, T81, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: less(T94, T93)\n\nT93 is ground\nX4 is free\nX5 is free\nmax(T1, T93, T3) !=? max(X4, X5, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="51: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 52 [arrowhead = none ];
52 -> 2;

53 [label="EVAL with clause\nmax(X4, X5, X4) :- less(X5, X4).\nand substitutionT1 -> T8,\nX4 -> T8,\nT2 -> T7,\nX5 -> T7,\nT3 -> T8,\nT6 -> T8", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 53 [arrowhead = none ];
53 -> 3;

54 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
2 -> 54 [arrowhead = none ];
54 -> 4;

55 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
3 -> 55 [arrowhead = none ];
55 -> 5;

56 [label="EVAL with clause\nmax(X72, X73, X73) :- less(X72, s(X73)).\nand substitutionT1 -> T82,\nX72 -> T82,\nT2 -> T81,\nX73 -> T81,\nT3 -> T81,\nT80 -> T82", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 56 [arrowhead = none ];
56 -> 42;

57 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
4 -> 57 [arrowhead = none ];
57 -> 43;

58 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
5 -> 58 [arrowhead = none ];
58 -> 6;

59 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
5 -> 59 [arrowhead = none ];
59 -> 7;

60 [label="EVAL with clause\nless(0, s(X10)).\nand substitutionT7 -> 0,\nX10 -> T13,\nT8 -> s(T13)", fontsize=14, style = filled, fillcolor = lightblue];
6 -> 60 [arrowhead = none ];
60 -> 8;

61 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
6 -> 61 [arrowhead = none ];
61 -> 9;

62 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
7 -> 62 [arrowhead = none ];
62 -> 11;

63 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
7 -> 63 [arrowhead = none ];
63 -> 12;

64 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 64 [arrowhead = none ];
64 -> 10;

65 [label="EVAL with clause\nless(s(X19), s(X20)) :- less(X19, X20).\nand substitutionX19 -> T22,\nT7 -> s(T22),\nX20 -> T24,\nT8 -> s(T24),\nT23 -> T24", fontsize=14, style = filled, fillcolor = lightblue];
11 -> 65 [arrowhead = none ];
65 -> 13;

66 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
11 -> 66 [arrowhead = none ];
66 -> 14;

67 [label="FAILURE", fontsize=14, style = filled, fillcolor = lightgreen];
12 -> 67 [arrowhead = none ];
67 -> 23;

68 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
13 -> 68 [arrowhead = none ];
68 -> 15;

69 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
15 -> 69 [arrowhead = none ];
69 -> 16;

70 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
15 -> 70 [arrowhead = none ];
70 -> 17;

71 [label="EVAL with clause\nless(0, s(X27)).\nand substitutionT22 -> 0,\nX27 -> T31,\nT24 -> s(T31)", fontsize=14, style = filled, fillcolor = lightblue];
16 -> 71 [arrowhead = none ];
71 -> 18;

72 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
16 -> 72 [arrowhead = none ];
72 -> 19;

73 [label="EVAL with clause\nless(s(X32), s(X33)) :- less(X32, X33).\nand substitutionX32 -> T36,\nT22 -> s(T36),\nX33 -> T38,\nT24 -> s(T38),\nT37 -> T38", fontsize=14, style = filled, fillcolor = lightblue];
17 -> 73 [arrowhead = none ];
73 -> 21;

74 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
17 -> 74 [arrowhead = none ];
74 -> 22;

75 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
18 -> 75 [arrowhead = none ];
75 -> 20;

76 [label="INSTANCE with matching:\nT22 -> T36\nT24 -> T38", fontsize=14, style = filled, fillcolor = lightgrey];
21 -> 76 [arrowhead = none , style=dashed];
76 -> 13[style=dashed];

77 [label="EVAL with clause\nmax(X40, X41, X41) :- less(X40, s(X41)).\nand substitutionT1 -> T47,\nX40 -> T47,\nT7 -> T46,\nX41 -> T46,\nT3 -> T46,\nT45 -> T47", fontsize=14, style = filled, fillcolor = lightblue];
23 -> 77 [arrowhead = none ];
77 -> 24;

78 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
23 -> 78 [arrowhead = none ];
78 -> 25;

79 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
24 -> 79 [arrowhead = none ];
79 -> 26;

80 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
26 -> 80 [arrowhead = none ];
80 -> 27;

81 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
26 -> 81 [arrowhead = none ];
81 -> 28;

82 [label="EVAL with clause\nless(0, s(X48)).\nand substitutionT47 -> 0,\nT46 -> T54,\nX48 -> T54", fontsize=14, style = filled, fillcolor = lightblue];
27 -> 82 [arrowhead = none ];
82 -> 29;

83 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
27 -> 83 [arrowhead = none ];
83 -> 30;

84 [label="EVAL with clause\nless(s(X53), s(X54)) :- less(X53, X54).\nand substitutionX53 -> T61,\nT47 -> s(T61),\nT46 -> T60,\nX54 -> T60,\nT59 -> T61", fontsize=14, style = filled, fillcolor = lightblue];
28 -> 84 [arrowhead = none ];
84 -> 32;

85 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
28 -> 85 [arrowhead = none ];
85 -> 33;

86 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
29 -> 86 [arrowhead = none ];
86 -> 31;

87 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
32 -> 87 [arrowhead = none ];
87 -> 34;

88 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
34 -> 88 [arrowhead = none ];
88 -> 35;

89 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
34 -> 89 [arrowhead = none ];
89 -> 36;

90 [label="EVAL with clause\nless(0, s(X61)).\nand substitutionT61 -> 0,\nX61 -> T68,\nT60 -> s(T68)", fontsize=14, style = filled, fillcolor = lightblue];
35 -> 90 [arrowhead = none ];
90 -> 37;

91 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
35 -> 91 [arrowhead = none ];
91 -> 38;

92 [label="EVAL with clause\nless(s(X66), s(X67)) :- less(X66, X67).\nand substitutionX66 -> T75,\nT61 -> s(T75),\nX67 -> T74,\nT60 -> s(T74),\nT73 -> T75", fontsize=14, style = filled, fillcolor = lightblue];
36 -> 92 [arrowhead = none ];
92 -> 40;

93 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
36 -> 93 [arrowhead = none ];
93 -> 41;

94 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
37 -> 94 [arrowhead = none ];
94 -> 39;

95 [label="INSTANCE with matching:\nT61 -> T75\nT60 -> T74", fontsize=14, style = filled, fillcolor = lightgrey];
40 -> 95 [arrowhead = none , style=dashed];
95 -> 32[style=dashed];

96 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
42 -> 96 [arrowhead = none ];
96 -> 44;

97 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
44 -> 97 [arrowhead = none ];
97 -> 45;

98 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
44 -> 98 [arrowhead = none ];
98 -> 46;

99 [label="EVAL with clause\nless(0, s(X78)).\nand substitutionT82 -> 0,\nT81 -> T87,\nX78 -> T87", fontsize=14, style = filled, fillcolor = lightblue];
45 -> 99 [arrowhead = none ];
99 -> 47;

100 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
45 -> 100 [arrowhead = none ];
100 -> 48;

101 [label="EVAL with clause\nless(s(X83), s(X84)) :- less(X83, X84).\nand substitutionX83 -> T94,\nT82 -> s(T94),\nT81 -> T93,\nX84 -> T93,\nT92 -> T94", fontsize=14, style = filled, fillcolor = lightblue];
46 -> 101 [arrowhead = none ];
101 -> 50;

102 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
46 -> 102 [arrowhead = none ];
102 -> 51;

103 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
47 -> 103 [arrowhead = none ];
103 -> 49;

104 [label="INSTANCE with matching:\nT61 -> T94\nT60 -> T93", fontsize=14, style = filled, fillcolor = lightgrey];
50 -> 104 [arrowhead = none , style=dashed];
104 -> 32[style=dashed];

}

(2) Obligation:

Clauses:

lessA(0, s(T31)).
lessA(s(T36), s(T38)) :- lessA(T36, T38).
lessB(0, s(T68)).
lessB(s(T75), s(T74)) :- lessB(T75, T74).
maxC(s(T13), 0, s(T13)).
maxC(s(T24), s(T22), s(T24)) :- lessA(T22, T24).
maxC(0, T54, T54).
maxC(s(T61), T60, T60) :- lessB(T61, T60).
maxC(0, T87, T87).
maxC(s(T94), T93, T93) :- lessB(T94, T93).

Query: maxC(a,g,a)

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
maxC_in: (f,b,f)
lessA_in: (b,f)
lessB_in: (f,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

MAXC_IN_AGA(s(T24), s(T22), s(T24)) → U3_AGA(T24, T22, lessA_in_ga(T22, T24))
MAXC_IN_AGA(s(T24), s(T22), s(T24)) → LESSA_IN_GA(T22, T24)
LESSA_IN_GA(s(T36), s(T38)) → U1_GA(T36, T38, lessA_in_ga(T36, T38))
LESSA_IN_GA(s(T36), s(T38)) → LESSA_IN_GA(T36, T38)
MAXC_IN_AGA(s(T61), T60, T60) → U4_AGA(T61, T60, lessB_in_ag(T61, T60))
MAXC_IN_AGA(s(T61), T60, T60) → LESSB_IN_AG(T61, T60)
LESSB_IN_AG(s(T75), s(T74)) → U2_AG(T75, T74, lessB_in_ag(T75, T74))
LESSB_IN_AG(s(T75), s(T74)) → LESSB_IN_AG(T75, T74)
MAXC_IN_AGA(s(T94), T93, T93) → U5_AGA(T94, T93, lessB_in_ag(T94, T93))

The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

The argument filtering Pi contains the following mapping:
maxC_in_aga(x1, x2, x3) = maxC_in_aga(x2)
0 = 0
maxC_out_aga(x1, x2, x3) = maxC_out_aga
s(x1) = s(x1)
U3_aga(x1, x2, x3) = U3_aga(x3)
lessA_in_ga(x1, x2) = lessA_in_ga(x1)
lessA_out_ga(x1, x2) = lessA_out_ga
U1_ga(x1, x2, x3) = U1_ga(x3)
U4_aga(x1, x2, x3) = U4_aga(x3)
lessB_in_ag(x1, x2) = lessB_in_ag(x2)
lessB_out_ag(x1, x2) = lessB_out_ag(x1)
U2_ag(x1, x2, x3) = U2_ag(x3)
U5_aga(x1, x2, x3) = U5_aga(x3)
MAXC_IN_AGA(x1, x2, x3) = MAXC_IN_AGA(x2)
U3_AGA(x1, x2, x3) = U3_AGA(x3)
LESSA_IN_GA(x1, x2) = LESSA_IN_GA(x1)
U1_GA(x1, x2, x3) = U1_GA(x3)
U4_AGA(x1, x2, x3) = U4_AGA(x3)
LESSB_IN_AG(x1, x2) = LESSB_IN_AG(x2)
U2_AG(x1, x2, x3) = U2_AG(x3)
U5_AGA(x1, x2, x3) = U5_AGA(x3)

We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MAXC_IN_AGA(s(T24), s(T22), s(T24)) → U3_AGA(T24, T22, lessA_in_ga(T22, T24))
MAXC_IN_AGA(s(T24), s(T22), s(T24)) → LESSA_IN_GA(T22, T24)
LESSA_IN_GA(s(T36), s(T38)) → U1_GA(T36, T38, lessA_in_ga(T36, T38))
LESSA_IN_GA(s(T36), s(T38)) → LESSA_IN_GA(T36, T38)
MAXC_IN_AGA(s(T61), T60, T60) → U4_AGA(T61, T60, lessB_in_ag(T61, T60))
MAXC_IN_AGA(s(T61), T60, T60) → LESSB_IN_AG(T61, T60)
LESSB_IN_AG(s(T75), s(T74)) → U2_AG(T75, T74, lessB_in_ag(T75, T74))
LESSB_IN_AG(s(T75), s(T74)) → LESSB_IN_AG(T75, T74)
MAXC_IN_AGA(s(T94), T93, T93) → U5_AGA(T94, T93, lessB_in_ag(T94, T93))

The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 2 SCCs with 7 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESSB_IN_AG(s(T75), s(T74)) → LESSB_IN_AG(T75, T74)

The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

(10) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(11) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESSB_IN_AG(s(T75), s(T74)) → LESSB_IN_AG(T75, T74)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1) = s(x1)
LESSB_IN_AG(x1, x2) = LESSB_IN_AG(x2)

We have to consider all (P,R,Pi)-chains

(12) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LESSB_IN_AG(s(T74)) → LESSB_IN_AG(T74)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LESSB_IN_AG(s(T74)) → LESSB_IN_AG(T74)
The graph contains the following edges 1 > 1

(15) YES

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESSA_IN_GA(s(T36), s(T38)) → LESSA_IN_GA(T36, T38)

The TRS R consists of the following rules:

maxC_in_aga(s(T13), 0, s(T13)) → maxC_out_aga(s(T13), 0, s(T13))
maxC_in_aga(s(T24), s(T22), s(T24)) → U3_aga(T24, T22, lessA_in_ga(T22, T24))
lessA_in_ga(0, s(T31)) → lessA_out_ga(0, s(T31))
lessA_in_ga(s(T36), s(T38)) → U1_ga(T36, T38, lessA_in_ga(T36, T38))
U1_ga(T36, T38, lessA_out_ga(T36, T38)) → lessA_out_ga(s(T36), s(T38))
U3_aga(T24, T22, lessA_out_ga(T22, T24)) → maxC_out_aga(s(T24), s(T22), s(T24))
maxC_in_aga(0, T54, T54) → maxC_out_aga(0, T54, T54)
maxC_in_aga(s(T61), T60, T60) → U4_aga(T61, T60, lessB_in_ag(T61, T60))
lessB_in_ag(0, s(T68)) → lessB_out_ag(0, s(T68))
lessB_in_ag(s(T75), s(T74)) → U2_ag(T75, T74, lessB_in_ag(T75, T74))
U2_ag(T75, T74, lessB_out_ag(T75, T74)) → lessB_out_ag(s(T75), s(T74))
U4_aga(T61, T60, lessB_out_ag(T61, T60)) → maxC_out_aga(s(T61), T60, T60)
maxC_in_aga(s(T94), T93, T93) → U5_aga(T94, T93, lessB_in_ag(T94, T93))
U5_aga(T94, T93, lessB_out_ag(T94, T93)) → maxC_out_aga(s(T94), T93, T93)

(17) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(18) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LESSA_IN_GA(s(T36), s(T38)) → LESSA_IN_GA(T36, T38)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1) = s(x1)
LESSA_IN_GA(x1, x2) = LESSA_IN_GA(x1)

We have to consider all (P,R,Pi)-chains

(19) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LESSA_IN_GA(s(T36)) → LESSA_IN_GA(T36)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(21) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LESSA_IN_GA(s(T36)) → LESSA_IN_GA(T36)
The graph contains the following edges 1 > 1

(0) Obligation:

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

(2) Obligation:

(3) PrologToPiTRSProof (SOUND transformation)

(4) Obligation:

(5) DependencyPairsProof (EQUIVALENT transformation)

(6) Obligation:

(7) DependencyGraphProof (EQUIVALENT transformation)

(8) Complex Obligation (AND)

(9) Obligation:

(10) UsableRulesProof (EQUIVALENT transformation)

(11) Obligation:

(12) PiDPToQDPProof (SOUND transformation)

(13) Obligation:

(14) QDPSizeChangeProof (EQUIVALENT transformation)

(15) YES

(16) Obligation:

(17) UsableRulesProof (EQUIVALENT transformation)

(18) Obligation:

(19) PiDPToQDPProof (SOUND transformation)

(20) Obligation:

(21) QDPSizeChangeProof (EQUIVALENT transformation)

(22) YES